Classical benchmarking of Gaussian Boson Sampling on the Titan supercomputer
نویسندگان
چکیده
منابع مشابه
Computing Permanents for Boson Sampling on Tianhe-2 Supercomputer
Junjie Wu, 2, ∗ Yong Liu, 2 Baida Zhang, Xianmin Jin, 4, † Yang Wang, 2 Huiquan Wang, 2 and Xuejun Yang 2, ‡ State Key Laboratory of High Performance Computing, National University of Defense Technology, Changsha 410073, China College of Computer, National University of Defense Technology, Changsha 410073, China State Key Laboratory of Advanced Optical Communication Systems and Networks, Instit...
متن کاملThe Classical Complexity of Boson Sampling
We study the classical complexity of the exact Boson Sampling problem where the objective is to produce provably correct random samples from a particular quantum mechanical distribution. The computational framework was proposed by Aaronson and Arkhipov in 2011 as an attainable demonstration of ‘quantum supremacy’, that is a practical quantum computing experiment able to produce output at a spee...
متن کاملA detailed study of Gaussian Boson Sampling
Since the development of Boson sampling, there has been a quest to construct more efficient and experimentally feasible protocols to test the computational complexity of sampling from photonic states. In this paper we interpret and extend the results presented in [Phys. Rev. Lett. 119, 170501 (2017)]. We derive an expression that relates the probability to measure a specific photon output patte...
متن کاملBoson sampling from a Gaussian state.
We pose a randomized boson-sampling problem. Strong evidence exists that such a problem becomes intractable on a classical computer as a function of the number of bosons. We describe a quantum optical processor that can solve this problem efficiently based on a Gaussian input state, a linear optical network, and nonadaptive photon counting measurements. All the elements required to build such a...
متن کاملThe Multiphoton Boson Sampling Machine Doesn't Beat Early Classical Computers for Five-boson Sampling
An ignored algorithm called Store-reuse for calculating the permanent of an n n matrix is considered. It utilizes computer storages sufficiently, and uses stored data repetitively. The analysis manifests that the numbers of multiplications and additions taken by the Store-reuse algorithm are respectively far smaller than those taken by the famous Ryser's algorithm. As to the 5-boson sampling,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quantum Information Processing
سال: 2020
ISSN: 1570-0755,1573-1332
DOI: 10.1007/s11128-020-02713-6